Optimizing Database Algorithms for Modern Computer Architectures
نویسندگان
چکیده
Acknowledgements There are many people I would like to thank for helping make this thesis possible. I'd like to start out by thanking my mom and dad. Without their support, love and infinite patience I doubt it would be possible for me to be where I am today. I'd also like to thank all of my family (no names for fear of leaving anyone out). They've been great to me throughout the years, always helping me when I need help, and offering me food when I'm hungry. This thesis would also not have been possible without the help of many faculty members I've had at Lehigh during the past few years. The knowledge they've passed on to me is immense, more than I ever knew possible. In particular I'd like to thank my advisor Henry Korth. He has been a wonderful advisor, always patient when results weren't quite ready, and understanding when my schedule slipped behind. He's also been extremely supportive of my work and has been a wonderful asset to this research. I'd also like to thank all of my friends I've met at Lehigh over the years. They have made this a wonderful place for which I've spent my last five years. They've taught me that as important as it may be to know your subject, its equally important to know who to turn to when you have questions. They've been there for me when I needed them, and helped me through many hard times. They've also made studying for classes much more fun. Who could forget the nights spent in the study lounge at 3am. It's been wonderful being here, and I'm going to miss everyone I've known as I go on about the rest of my life. I'd like to dedicate this thesis in memory of Karl Mueller. Karl Mueller was the bassist for Soul Asylum for the past twenty plus years. In the many years that I iv have listened to Soul Asylum, I have seen countless concerts, and have grown to know the band quite well. On many occasions I have spoken with Karl and he has become a friend of mine. Karl passed away in early June from complications due to throat cancer. He will be dearly missed, but his life and the music that he made will live on forever.
منابع مشابه
Relational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملEfficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits
Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...
متن کاملEfficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits
Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...
متن کاملLearning Policies for Local Instruction Scheduling
Execution speed of programs on modern computer architectures is sensitive, by a factor of two or more, to the order in which instructions are presented to the processor. To realize potential execution efficiency, it is now customary for an optimizing compiler to employ a heuristic algorithm for instruction scheduling. These algorithms are currently hand-crafted. We show how to cast the local in...
متن کاملLearning to Schedule Straight-Line Code
Execution speed of programs on modern computer architectures is sensitive, by a factor of two or more, to the order in which instructions are presented to the processor. To realize potential execution efficiency, it is now customary for an optimizing compiler to employ a heuristic algorithm for instruction scheduling. These algorithms are painstakingly hand-crafted, which is expenseive and time...
متن کاملOptimizing Main-Memory Join on Modern Hardware
ÐIn the past decade, the exponential growth in commodity CPU's speed has far outpaced advances in memory latency. A second trend is that CPU performance advances are not only brought by increased clock rate, but also by increasing parallelism inside the CPU. Current database systems have not yet adapted to these trends and show poor utilization of both CPU and memory resources on current hardwa...
متن کامل